The tadpole conjecture in asymptotic limits
نویسندگان
چکیده
The tadpole conjecture suggests that the complete stabilization of complex structure deformations in Type IIB and F-theory flux compactifications is severely obstructed by bound on fluxes. More precisely, it states a large number moduli requires background with scales linearly stabilized fields. Restricting to asymptotic regions space, we give first conceptual argument explains this linear scaling setting clarifies why sets only for moduli. Our approach relies use Hodge theory. In particular, fact each regime an orthogonal sl(2)-block emerges allows us group fluxes into sl(2)-representations decouple directions. We show supported fluxes, representation fixes single modulus. Furthermore, find Calabi-Yau four-folds all but one can be identified representations occurring two-folds. This discuss explicitly establish relevant constraints tadpole.
منابع مشابه
The Asymptotic Method in the Novikov Conjecture
The famous Hirzebruch signature theorem asserts that the signature of a closed oriented manifold is equal to the integral of the so called L-genus. An immediate corollary of this is the homotopy invariance of < L(M); [M ] >. The L-genus is a characteristic class of tangent bundles, so the above remark is a non-trivial fact. The problem of higher signatures is a generalization of the above consi...
متن کاملThe Novikov conjecture and groups with finite asymptotic dimension ∗
Recall that the asymptotic dimension is a coarse geometric analogue of the covering dimension in topology [14]. More precisely, the asymptotic dimension for a metric space is the smallest integer n such that for any r > 0, there exists a uniformly bounded cover C = {Ui}i∈I of the metric space for which the rmultiplicity of C is at most n + 1, i.e. no ball of radius r in the metric space interse...
متن کاملAsymptotic Performance Limits for Fair Routing and
We consider the performance evaluation of routing and rate allocation (RRA) algorithms in rate-based multi-class networks, in particular, networks supporting the IntServ architecture. An RRA algorithm will result in a vector of carried traacs, with each element corresponding to a class. While maximizing the aggregate weighted carried traac is a natural objective, it can lead to unfair operation...
متن کاملAn Asymptotic Result for the Path Partition Conjecture
The detour order of a graph G, denoted by τ (G) , is the order of a longest path in G. A partition of the vertex set of G into two sets, A and B, such that τ(〈A〉) ≤ a and τ(〈B〉) ≤ b is called an (a, b)-partition of G. If G has an (a, b)-partition for every pair (a, b) of positive integers such that a + b = τ(G), then we say that G is τ -partitionable. The Path Partition Conjecture (PPC), which ...
متن کاملThe Asymptotic Limits of Zero Modes of Massless Dirac Operators
Asymptotic behaviors of zero modes of the massless Dirac operator H = α ·D+Q(x) are discussed, where α = (α1, α2, α3) is the triple of 4×4 Dirac matrices, D = 1i ∇x, and Q(x) = ( qjk(x) ) is a 4×4 Hermitian matrix-valued function with |qjk(x)| ≤ C〈x〉 −ρ, ρ > 1. We shall show that for every zero mode f , the asymptotic limit of |x|f(x) as |x| → +∞ exists. The limit is expressed in terms of an in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2022
ISSN: ['1127-2236', '1126-6708', '1029-8479']
DOI: https://doi.org/10.1007/jhep08(2022)237